Space-filling curves for Partitioning Adaptively Refined Meshes
نویسندگان
چکیده
We present a general space-filling curve algorithm for partitioning an arbitrary 3D mesh. We discuss communication patterns in Adaptive Mesh Refinement (AMR) applications and how we can reduce communication and improve the quality of partitions using a better space-filling curve. We compare the our partitions with those generated using Morton order, which is currently used by majority of AMR software frameworks. We used the MiniAMR miniapp from Mantevo to generate our test cases and also measure the various costs involved in adpative mesh refinement.
منابع مشابه
Load Balancing for Adaptively Refined Grids
The solution of partial differential equations on a parallel computer is usually done by a data parallel approach. The grid is partitioned and mapped onto the processors. However, partitioning of unstructured meshes and adaptively refined meshes in general is an NP -hard problem and heuristics are needed. In this paper a parallelisable and cheap method based on space-filling curves is analysed....
متن کاملTime Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves
This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...
متن کاملA Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries
Preliminary verification and validation of an efficient Euler solver for adaptively refined Carte-sian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The c...
متن کاملA Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves
Linear orderings defined through space-filling curves are often applied to quickly partition graphs arising in finite element simulations. In applications with constant meshes but a rapidly changing load per element, an ordering has to be determined only once and all subsequent partitionings can be computed very quickly through a simple interval splitting. However, partitionings based on space-...
متن کاملA refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...
متن کامل